A Note on Hadwiger’s Conjecture

نویسنده

  • David R. Wood
چکیده

Hadwiger’s Conjecture [7] states that every Kt+1-minor-free graph is t-colourable. It is widely considered to be one of the most important conjectures in graph theory; see [21] for a survey. If every Kt+1-minor-free graph has minimum degree at most δ, then every Kt+1minor-free graph is (δ+1)-colourable by a minimum-degree-greedy algorithm. The purpose of this note is to prove a slightly better upper bound.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on the Hadwiger number of circular arc graphs

The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G, and let χ(G) denote its chromatic number. Hadwiger’s conjecture states that η(G) ≥ χ(G) and is one of the most important and difficult open problems in graph theory. From the point of view of researchers who are sceptical of the...

متن کامل

On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture

The main result of this paper is the following: Any minimal counterexample to Hadwiger’s Conjecture for the k-chromatic case is 2k 27 -connected. This improves the previous known bound due to Mader [W. Mader, Über trennende Eckenmengen in homomorphiekritischen Graphen, Math. Ann. 175 (1968) 243–252], which says that any minimal counterexample to Hadwiger’s Conjecture for the k-chromatic case is...

متن کامل

An Approach to Hadwiger's Conjecture through Squares of Chordal Graphs

Hadwiger’s conjecture states that for every graph G, χ(G) ≤ η(G), where χ(G) is the chromatic number and η(G) is the size of the largest clique minor in G. In this work, we show that to prove Hadwiger’s conjecture in general, it is sufficient to prove Hadwiger’s conjecture for the class of graphs F defined as follows: F is the set of all graphs that can be expressed as the square graph of a spl...

متن کامل

Hadwiger’s conjecture

This is a survey of Hadwiger’s conjecture from 1943, that for all t ≥ 0, every graph either can be t-coloured, or has a subgraph that can be contracted to the complete graph on t + 1 vertices. This is a tremendous strengthening of the four-colour theorem, and is probably the most famous open problem in graph theory.

متن کامل

Nowhere-zero Flows in Regular Matroids and Hadwiger’s Conjecture

We present a tool that shows, that the existence of a k-nowhere-zero-flow is compatible with 1-,2and 3-sums in regular matroids. As application we present a conjecture for regular matroids that is equivalent to Hadwiger’s conjecture for graphs and Tuttes’s 4and 5-flow conjectures.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013